Geometrical Mesh Improvement Properties of Delaunay Terminal Edge Refinement
نویسندگان
چکیده
The use of edge based refinement in general, and Delaunay terminal edge refinement in particular are well established for planar meshing, but largely on a heuristic basis. In this paper, we present a series of theoretical results on the geometric mesh improvement properties of these methods. The discussion is based on refining a mesh to meet a specified angle tolerance.
منابع مشابه
Snow Globe: An Advancing-Front 3D Delaunay Mesh Refinement Algorithm
One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral elements having a bounded aspect ratio, which is the ratio between the radius of the circumscribing and inscribing spheres. The refinement is carried out by inserting additional Steiner vertices inside the circumsphere of a poor-quality tetrahedron (to remove the tetrahedron) at a sufficient dist...
متن کاملA Study on Delaunay Terminal Edge Method
The Delaunay terminal edge algorithm for triangulation improvement proceeds by iterative Lepp selection of a point M which is midpoint of a Delaunay terminal edge in the mesh. The longest edge bisection of the associated terminal triangles (sharing the terminal edge) can be seen as a first step in the Delaunay insertion of M . The method was introduced as a generalization of non-Delaunay longes...
متن کاملLocally optimal Delaunay-refinement and optimisation-based mesh generation
The field of mesh generation concerns the development of efficient algorithmic techniques to construct high-quality tessellations of complex geometrical objects. In this thesis, I investigate the problem of unstructured simplicial mesh generation for problems in R and R, in which meshes consist of collections of triangular and tetrahedral elements. I focus on the development of efficient algori...
متن کاملDelaunay mesh construction
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can ...
متن کاملOn the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H P ) of the size of any Delaunay mesh of P with bounded radius-edge ratio. The term HP depends on the geometry of P and it is likely a small constant when the boundaries of P are fine triangular meshes. There are several consequences. First, among...
متن کامل